Recherche de passages pertinents dans les fichiers logs par enrichissement de requ%EAtes.

PGP%2Dmc Towards a Multicore Parallel Approach for Mining Gradual Patterns.

Context%2Daware generalization for cube measures.

Context%2Daware generalization for cube measures.



Salines  un automate au service de l%27extraction de motifs s%E9quentiels multidimensionnels.

Bien cube%2C les donn%E9es textuelles peuvent s%27agr%E9ger %21

Une structure bas%E9e sur les hi%E9rarchies pour synth%E9tiser les itemsets fr%E9quents extraits dans des fen%EAtres temporelles.

Mining Closed Gradual Patterns.
With the steady development of the computing tools, we attended last three decades a considerable increase of the quantity of data stored in databases. So, extracting knowledge from this data is of paramount importance. Data mining is becoming an inescapable tool to reach this goal. Association rule extraction is one
Intelligent Energy Data Warehouse What Challenges%3F

Passage Retrieval in Log Files An Approach Based on Query Enrichment.
Abstract. The question answering systems are considered the next generation of search engines. This paper focuses on the first step of this process, which is to search for relevant passages containing answers. Passage Retrieval, can be difficult because of the complexity of data, log files in our case. Our contribution is based on the enrichment of queries by using a learning method and a novel term weighting function. This original term weighting function, used within the enrichment process, aims to assign a weight to terms according to their relatedness to the context of answers. Experiments conducted on real data show that our protocol of primitive query enrichment make it possible to retrieve relevant passages. 1
Summarizing Multidimensional Data Streams A Hierarchy%2DGraph%2DBased Approach.
Abstract. With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stream history is unfeasible and providing a high-quality summary is required for decision makers. In this paper, we propose a summarization method for multidimensional data streams based on a graph structure and taking advantage of the data hierarchies. The summarization method we propose takes into account the data distribution and thus overcomes a major drawback of the Tilted Time Window common framework. Finally, we adapt this structure for synthesizing frequent itemsets extracted on temporal windows. Thanks to our approach, as users do not analyze any more numerous extraction results, the result processing is improved. Experiments conducted on both synthetic and real datasets show that our approach can be applied on data streams. 1
Fuzzy Multidimensional Databases.

Fen%EAtres sur cube.

Extraction of unexpected sentences A sentiment classification assessed approach.
Sentiment classification in text documents is an active data mining research topic in opinion retrieval and analysis. Different from previous studies concentrating on the development of effective classifiers, in this paper, we focus on the extraction and validation of unexpected sentences issued in sentiment classification. In this paper, we propose a general framework for determining unexpected sentences. The relevance of the extracted unexpected sentences is assessed in the context of text classification. In the experiments, we present the extraction of unexpected 1 sentences for sentiment classification within the proposed framework, and then evaluate the influence of unexpected sentences on the quality of classification tasks. The experimental results show the effectiveness and usefulness of our proposed approach.
Speed up gradual rule mining from stream data%21 A B%2DTree and OWA%2Dbased approach.
Gradual rules allow users to be provided with rules describing the ordering correlations among attributes. Such a rule is for instance given by the higher the salary and the lower the number of cars, the higher the number of tourist travels. Previously intensively used in fuzzy command systems, these rules were manually provided to the system. More recently, they have received attention from the data mining community and methods have been defined to automatically extract and maintain gradual rules from numerical databases. However, no method has been shown to be able to handle data streams, as no method is scalable enough to manage the high rate which stream data arrive at. In this paper, we thus propose an original approach to mine data streams for gradual rules. Our method is based on B-Trees and OWA (Ordered Weighted Aggregation) operator in order to speed up the process. B-Trees are used to store already-known gradual rules in order to maintain the knowledge over time, while OWA operators provide a fast way to discard non relevant data.
Mining multidimensional and multilevel sequential patterns.

Multidimensional Data Stream Summarization Using Extended Tilted%2DTime Windows.

Terminology Extraction from Log Files.
In many domains, the log files generated by digital systems contain important information on the conditions and configurations of systems. Information Extraction from these log files is an essential phase in information systems, which manage the production line. In the case of Integrated Circuit designs, log files generated by design tools are not exhaustively exploited. Although these log files are written in English, they usually do not respect the grammar and the structures of natural language. Moreover, such logs have a heterogeneous and evolving structure. According to features of such textual data, applying the classical methods of information extraction is not an easy task, more particularly for terminology extraction. In this paper, we thus introduce our approach EXTERLOG to extract the terminology from such log files. We also aim at knowing if POS tagging of such log files is a relevant approach for terminology extraction. 1
Extraction efficace de r%E8gles graduelles.

D%E9tection de s%E9quences atypiques bas%E9e sur un mod%E8le de Markov d%27ordre variable.

DBFrequentQueries Extraction de requ%EAtes fr%E9quentes.

GRAANK Exploiting Rank Correlations for Extracting Gradual Itemsets.

Mining Frequent Gradual Itemsets from Large Databases.

Mining for Relevant Terms from Log Files.

A conceptual model for handling personalized hierarchies in multidimensional databases.

FTMnodes Fuzzy tree mining based on partial inclusion.

Mining convergent and divergent sequences in multidimensional data.

Softening the blow of frequent sequence analysis soft constraints and temporal accuracy.

Tree mining Equivalence classes for candidate generation.

S2MP Similarity Measure for Sequential Patterns.
In data mining, computing the similarity of objects is an essential task, for example to identify regularities or to build homogeneous clusters of objects. In the case of sequential data seen in various fields of application (e.g. series of customers purchases, Internet navigation) this problem (i.e. comparing the similarity of sequences) is very important. There are already some similarity measures as Edit distance and LCS suited to simple sequences, but these measures are not relevant in the case of complex sequences composed of sets of items, as is the case of sequential patterns. In this paper, we propose a new similarity measure taking the characteristics of sequential patterns into account. S 2 MP is an adjustable measure depending on the importance given to each characteristic of sequential patterns according to context, which is not the case of existing measures. We have experimented the accuracy and quality of S 2 MP against Edit distance by using them in a clustering of sequential patterns. The results show that the clusters obtained by S 2 MP are more homogeneous. Moreover these cluster are more precise and more complete according to the clusters obtained using Edit distance. The experiments show also that S 2 MP is efficient in term of calculation time and size of used memory.
Fast extraction of gradual association rules a heuristic based method.

Recognizing unexpected recurrence behaviors with fuzzy measures in sequence databases.

FFTM optimized frequent tree mining with soft embedding constraints on siblings.

Learning Bayesian Network Structure from Incomplete Data without Any Assumption.

Extraction of Opposite Sentiments in Classified Free Format Text Reviews.

Up and Down Mining Multidimensional Sequential Patterns Using Hierarchies.

Visualisation des motifs s%E9quentiels extraits %E0 partir d%92un corpus en Ancien Fran%E7ais.

D%E9couverte de motifs s%E9quentiels et r%E8gles inattendues.

Extraction de Motifs S%E9quentiels Multidimensionnels Clos sans Gestion d%92Ensemble de Candidats.

Mining Unexpected Web Usage Behaviors.

Detection of Sequential Outliers Using a Variable Length Markov Model.

Des s%E9quences aux tendances.

Sequential Patterns for Maintaining Ontologies over Time.

Mining multiple%2Dlevel fuzzy blocks from multidimensional data.

Motifs s%E9quentiels multidimensionnels et mesure. Diff%E9rentes techniques pour calculer le support.

Mining unexpected multidimensional rules.

Extraction de s%E9quences multidimensionnelles convergentes et divergentes.

SPoID  Extraction de motifs s%E9quentiels pour les bases de donn%E9es incompl%E8tes.

SPoID Do Not Throw Meaningful Incomplete Sequences Away%21.
Industrial databases often contain a large amount of unfilled information. During the knowledge discovery process one processing step is often necessary in order to remove these incomplete data either by deleting or assessing them. When the data mining task consists in mining for frequent sequences, incomplete data are, most of the time, deleted, which leads to an important loss of information. Extracted knowledge then becomes less representative of the database. Therefore we propose a method that uses the partial information contained in incomplete records, only temporary ignoring the missing part of the record. Experiments run on various synthetic datasets show the validity of our proposal as well in terms of quality as in terms of the robustness to the rate of missing values.
Approximate Sequential Patterns for Incomplete Sequence Database Mining.

On Transversal Hypergraph Enumeration in Mining Sequential Patterns.

Fuzzy Tree Mining Go Soft on Your Nodes.
Abstract. Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the Internet is now described by trees (e.g. XML). Still, for several documents dealing with the same topic, this description is not always the same. It is thus necessary to mine a common structure in order to query these documents. Biology is another field where data may be described by means of trees. The problem of mining trees has now been addressed for several years, leading to well-known algorithms. However, these algorithms can hardly deal with real data in a soft manner. Indeed, they consider a subtree as fully included in the super-tree. This means that all the nodes must appear. In this paper, we extend this definition to fuzzy inclusion based on the idea that a tree is included to a certain degree within another one, this fuzzy degree being correlated to the number of matching nodes. 1
Extended Time Constraints for Sequence Mining.

From Crispness to Fuzziness Three Algorithms for Soft Sequential Pattern Mining.

HYPE mining hierarchical sequential patterns.


Recherche de sous%2Dstructures fr%E9quentes pour l%27int%E9gration de sch%E9mas XML.


Pixelizing Data Cubes A Block%2DBased Approach.

Sequential patterns for text categorization.

Motifs s%E9quentiels multidimensionnels %E9toil%E9s.

Motifs s%E9quentiels flous  un peu%2C beaucoup%2C passionn%E9ment.

RSF %2D A New Tree Mining Approach with an Ecient Data Structure.

M2SP Mining Sequential Patterns Among Several Dimensions.

Ordre et d%E9sordre dans la cat%E9gorisation de textes.

R%E9sum%E9 de cubes de donn%E9es multidimensionnelles %E0 l%27aide de r%E8gles floues.

Improvement of the Interpretability of Fuzzy Rule Based Systems Quantifiers

A new approach for the generation of fuzzy summaries based on fuzzy multidimensional databases.

Querying Fuzzy Multidimensional Databases Unary Operators and Their Properties.

D%E9tection de cellules anormalement vides dans les bases de donn%E9es multidimensionnelles.

Bases de donn%E9es multidimensionnelles floues.

De l%27OLAP Mining au F%2DOLAP Mining  repr%E9sentations de donn%E9es imparfaites dans les bases de donn%E9es multidimensionnelles pour la fouille de donn%E9es.

Generating Fuzzy Summaries from Fuzzy Multidimensional Databases.

